Gröbner Bases via Linkage
نویسندگان
چکیده
In this paper, we give a sufficient condition for a set G of polynomials to be a Gröbner basis with respect to a given term-order for the ideal I that it generates. Our criterion depends on the linkage pattern of the ideal I and of the ideal generated by the initial terms of the elements of G. We then apply this criterion to ideals generated by minors and pfaffians. More precisely, we consider large families of ideals generated by minors or pfaffians in a matrix or a ladder, where the size of the minors or pfaffians is allowed to vary in different regions of the matrix or the ladder. We use the sufficient condition that we established to prove that the minors or pfaffians form a reduced Gröbner basis for the ideal that they generate, with respect to any diagonal or anti-diagonal term-order. We also show that the corresponding initial ideal is Cohen-Macaulay and squarefree, and that the simplicial complex associated to it is vertex decomposable, hence shellable. Our proof relies on known results in liaison theory, combined with a simple Hilbert function computation. In particular, our arguments are completely algebraic.
منابع مشابه
Freeness Theorems for Operads via Gröbner Bases
We show how to use Gröbner bases for operads to prove various freeness theorems: freeness of certain operads as nonsymmetric operads, freeness of an operad Q as a P-module for an inclusion P ֒→ Q, freeness of a suboperad. This gives new proofs of many known results of this type and helps to prove some new results.
متن کاملA Step in Castelnuovo Theory via Gröbner Bases
We establish the first previously unknown case of the EisenbudHarris conjecture in Castelnuovo theory concerning algebraic curves of high genus in Pn. The problem is reduced to a question about zero-dimensional schemes Γ ⊂ P in symmetric position with certain constrains on the Hilbert function. The method of Gröbner bases is then applied to study the homogeneous ideal of Γ.
متن کاملMATH536A Paper: Gröbner Bases
An introduction to Gröbner bases and some of their uses in affine algebraic geometry.
متن کاملExact Computat ion Using Approximate Gröbner Bases
We discuss computation of approximate Gröbner bases at high but finite precision. We show how this can be used to deduce exact results for various applications. Examples include implicitizing surfaces, finding multivariate polynomial greatest common divisors and factorizations over the rational and complex number fields. This is an extended version of a paper for SYNASC 2010, titled úPolynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011